owards the Interchange of Con gurable EPCs An ML-based Approach for Reference Model Con guration
نویسندگان
چکیده
Recent research has led to proposals for the model-driven configuration of Enterprise Systems (ES) by the help of configurable reference models. While the proposed on gura le P s (C-EPCs) provide adequate conceptual support towards reference model configuration, the issue of translating the configured models towards executable process specifications has not been approached yet. A first step in this direction is the definition of a machine-readable format for C-EPCs that can be used as an interchange format and as an input format for transformations. This paper proposes a C-EPC representation in XML based on the P Mar up anguage (EPML) format. We take the formal C-EPC syntax definition as a starting point to define the requirements for a respective extension to EPML and introduce a C-EPC representation in EPML. Furthermore, we introduce the P alidator, a program that generates validity reports for C-EPCs represented in EPML. The C-EPC Validator can be used to validate both configurable and configured C-EPCs. Finally, we highlight future application areas of the C-EPC schema.
منابع مشابه
Reconngurable Computing: Architectures, Models and Algorithms Current Science: Special Section on Computational Science
ion Mapping Parameters Scheduling Figure 2: Traditional Design Synthesis Approach and the Model-based Approach One major problem in using FPGAs to speed-up a computation is the design process. The \standard CAD approach" used for digital design is typically employed (see Figure 2). The required functionality is speci ed at a high level of abstraction via an HDL or a schematic. FPGA libraries sp...
متن کاملRun-Time Management of Dynamically Recon gurable Designs
A method for managing recon gurable designs, which supports run-time con guration transformation, is proposed. This method involves structuring the recon guration manager into three components: a monitor, a loader, and a con guration store. Di erent trade-o s can be achieved in con guration time, optimality of the con gured circuits, and the complexity of the recon guration manager, depending o...
متن کاملSelf Con guring Binary Multipliers for LUT addressable FPGAs
In this paper we present a self con gurable multiplication technique allowing vari able con guration time for a class of LUT based Field Programmable Gate Arrays FPGAs which exist today We show this technique to be implementable on FPGA architectures allowing internally addressable RAM primitives to be directly mapped to the Logic Elements LEs of the logic resource This provides run time read w...
متن کاملCon guration Cloning: Exploiting Regularity in Dynamic DSP Architectures
Existing FPGAs have fairly simple and ine cient con guration mechanisms due to the relative infrequency of recon guration. However a large class of dynamically con gurable architectures for DSP and communications can bene t from special-purpose con guration mechanisms which allow signi cant savings in con guration speed, power and memory. Light weight con guration mechanisms allow much ner grai...
متن کاملFramework and Tools for Run-Time Recon gurable Designs
This paper describes a framework and tools for automating the production of designs that can be partially recon gured at run time. The approach involves several stages, including: (i) a partial evaluation stage, which produces con guration les for a given design, where the number of con gurations are minimised during the compile-time sequencing stage; (ii) an incremental con guration calculatio...
متن کامل